@InCollection{OliveiraChagBern:2017:AnReAl,
               author = "Oliveira, Sanderson L. G. de and Chagas, Guilherme Oliveira and 
                         Bernardes, J. Assis B.",
                title = "An analysis of reordering algorithms to reduce the computational 
                         cost of the jacobi-preconditioned cg solver using high-precision 
                         arithmetic",
            booktitle = "Lecture Notes in Computer Science",
            publisher = "Springer",
                 year = "2017",
               editor = "Murgante, B. and O., Apduhan. B. and Borruso, G. and Stankova, E. 
                         and Gervasi, O. and Misra, S. and Taniar, D. and Rocha, A. M. A. 
                         C. and Cuzzocrea, A. and Torre, C. M.",
                pages = "3--19",
             keywords = "Bandwidth reduction, combinatorial optimization, conjugate 
                         gradient method, graph algorithm, graph labeling, heuristics, 
                         high-precision arithmetic Ordering Profile reduction Reordering 
                         algorithms, sparse matrices, sparse symmetric positive-definite 
                         linear systems.",
             abstract = "Several heuristics for bandwidth and profile reductions have been 
                         proposed since the 1960s. In systematic reviews, 133 heuristics 
                         applied to these problems have been found. The results of these 
                         heuristics have been analyzed so that, among them, 13 were 
                         selected in a manner that no simulation or comparison showed that 
                         these algorithms could be outperformed by any other algorithm in 
                         the publications analyzed, in terms of bandwidth or profile 
                         reductions and also considering the computational costs of the 
                         heuristics. Therefore, these 13 heuristics were selected as the 
                         most promising low-cost methods to solve these problems. Based on 
                         this experience, this article reports that in certain cases no 
                         heuristic for bandwidth or profile reduction can reduce the 
                         computational cost of the Jacobi-preconditioned Conjugate Gradient 
                         Method when using high-precision numerical computations.",
          affiliation = "{} and {Instituto Nacional de Pesquisas Espaciais (INPE)}",
                  doi = "10.1007/978-3-319-62392-4_1",
                  url = "http://dx.doi.org/10.1007/978-3-319-62392-4_1",
                 isbn = "978-331962391-7",
             language = "en",
        urlaccessdate = "27 abr. 2024"
}